منابع مشابه
The isomorphism problem for circulant graphs via Schur ring theory
This paper concerns the applications of Schur ring theory to the isomorphism problem of circulant graphs (Cayley graphs over cyclic groups). A digest of the most important facts about Schur rings presented in the first sections provides the reader with agentie self-eontained introduction to this area. The developed machinery allows us to give proofs of two eonjectures (Zibin' 1975 and Toida 197...
متن کاملSubgroup Isomorphism Problem for Units of Integral Group Rings
The Subgroup Isomorphism Problem for Integral Group Rings asks for which finite groups U it is true that if U is isomorphic to a subgroup of V(ZG), the group of normalized units of the integral group ring of the finite group G, it must be isomorphic to a subgroup of G. The smallest groups known not to satisfy this property are the counterexamples to the Isomorphism Problem constructed by M. Her...
متن کاملUltraproducts and the Group Ring Semiprimitivity Problem
This expository paper is a slightly expanded version of the final talk I gave at the group rings conference celebrating the 25th anniversary of the Institute of Mathematics and Statistics at the University of São Paulo. The talk concerned an application of ultraproducts to the solution of the semiprimitivity problem for group algebras K[G] of locally finite groups G. It explained why the specia...
متن کاملThe Graph Isomorphism Problem
The graph isomorphism problem can be easily stated: check to see if two graphs that look di erently are actually the same. The problem occupies a rare position in the world of complexity theory, it is clearly in NP but is not known to be in P and it is not known to be NP-complete. Many sub-disciplines of mathematics, such as topology theory and group theory, can be brought to bear on the proble...
متن کاملDefinable isomorphism problem
We investigate the isomorphism problem in the setting of definable sets (equivalent to sets with atoms): given two definable relational structures, are they related by a definable isomorphism? Under mild assumptions on the underlying structure of atoms, we prove decidability of the problem. The core result is parameter-elimination: existence of an isomorphism definable with parameters implies e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Quarterly Journal of Mathematics
سال: 2018
ISSN: 0033-5606,1464-3847
DOI: 10.1093/qmath/hay020